Non-commutative Polynomial Computations
نویسندگان
چکیده
In [6] Mora described an algorithm which, if it terminates, returns a noncommutative Gröbner basis. Here we follow that paper to prove the correctness of the algorithm as implemented by Dié Gijsbers and the author in GAP, cf. [1]. The algorithm is the core algorithm of the GAP package GBNP for computing with non-commutative polynomials. Earlier versions of this section were written with the help of Dié Gijsbers.
منابع مشابه
A Note on Data Types Supporting E cient Implementations of Polynomial Arithmetics
There are discussed implementational aspects of the special-purpose computer algebra system FELIX designed for computations in constructive algebra. In particular, data types developed for the representation of and computation with commutative and non-commutative polynomials are described. Furthermore, comparisons of time and memory requirements of di erent polynomial representations are reported.
متن کاملCanonical Bases for Algebraic Computations
We investigate, for quotients of the non-commutative polynomial ring, a property that implies finiteness of Gröbner bases computation, and examine its connection with Noetherianity. We propose a Gröbner bases theory for our factor algebras, of particular interest for one-sided ideals, and show a few applications, e.g. how to compute (one-sided) syzygy modules.
متن کاملEfficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings
In this paper we study arithmetic computations over non-associative, and non-commutative free polynomials ring F{x1, x2, . . . , xn}. Prior to this work, the non-associative arithmetic model of computation was considered by Hrubes, Wigderson, and Yehudayoff [HWY10]. They were interested in completeness and explicit lower bound results. We focus on two main problems in algebraic complexity theor...
متن کاملNon-commutative computations: lower bounds and polynomial identity testing
In the setting of non-commutative arithmetic computations, we define a class of circuits that generalize algebraic branching programs (ABP). This model is called unambiguous because it captures the polynomials in which all monomials are computed in a similar way (that is, all the parse trees are isomorphic). We show that unambiguous circuits of polynomial size can compute polynomials that requi...
متن کاملSolving the ARE Symbolically
Methods from computer algebra, mostly so called Grr obner bases from commutative algebra, are used to solve the algebraic Riccati equation (ARE) symbolically. The methods suggested allow us to track the innuence of parameters in the system or penalty matrices on the solution. Some non-trivial aspects arise when addressing the problem from the point of view commutative algebra, for example the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007